Rewriting Rules for Arithmetics in Alternate Base Systems
نویسندگان
چکیده
For alternate Cantor real base numeration systems we generalize the result of Frougny and Solomyak on arithmetics set numbers with finite expansion. We provide a class bases which satisfy so-called finiteness property. The proof uses rewriting rules language expansions in corresponding system. is constructive provides method for performing addition bases.
منابع مشابه
Rules and Arithmetics
This paper is concerned with the logical structure of arithmetical the ories We survey results concerning logics and admissible rules of con structive arithmetical theories We prove a new theorem the admissible propositional rules of Heyting Arithmetic are the same as the admissible propositional rules of Intuitionistic Propositional Logic We provide some further insights concerning predicate l...
متن کاملArithmetics in numeration systems with negative quadratic base
We consider positional numeration system with negative base −β, as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when β is a quadratic Pisot number. We study a class of roots β > 1 of polynomials x − mx − n, m ≥ n ≥ 1, and show that in this case the set Fin(−β) of finite (−β)-expansions is closed under addition, although it is not closed unde...
متن کاملCompact Rewriting for Existential Rules
Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly...
متن کاملLearning Plan Rewriting Rules
Considerable work has been done to automatically learn domain-specific knowledge to improve the performance of domain independent problem solving systems. However, most of this work has focussed on learning search control knowledge-knowledge that can be used by a problem solving system during search to improve its performance. An alternative approach to improving the performance of domain indep...
متن کاملLearning Plan Rewriting Rules
Planning by Rewriting (PbR) is a new paradigm for efcient high-quality planning that exploits plan rewriting rules and e cient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. Despite the advantages of PbR in terms of scalability, plan quality, and anytime behavior, PbR requires the user to de ne a set of domain-speci c pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-33264-7_16